Ordinal algorithms for parallel machine scheduling
نویسندگان
چکیده
منابع مشابه
Ordinal algorithms for parallel machine scheduling
The minimization of maximum completion time for scheduling n jobs on m identical parallel machines is an NP-hard problem for which many excellent heuristic algorithms have been developed. In this paper, the problem is investigated under the assumption that only limited information about the jobs is available. Specifically, processing times are not known for the jobs; rather, the ordering of the...
متن کاملExact and approximate algorithms for high-multiplicity parallel machine scheduling
In many scheduling applications, a large number of jobs are grouped into a comparatively small number of lots, made of identical items. It is then sufficient to give, for each lot, the number of jobs it involves plus the description of one single job. The resulting high-multiplicity input format is much more compact than the standard one. As a consequence, in order to be efficient, standard sol...
متن کاملScatter Search Algorithms for Identical Parallel Machine Scheduling Problems
We address the Identical Parallel Machine Scheduling Problem, one of the most important basic problems in scheduling theory, and some generalizations of it arising from real world situations. We survey the current state of the art for the most performing meta-heuristic algorithms for this class of problems, with special emphasis on recent results obtained through Scatter Search. We present insi...
متن کاملHeuristic algorithms for a complex parallel machine scheduling problem
In this work we present a new scheduling model for parallel machines, which extends the multiprocessor scheduling problem with release times for minimizing the total tardiness, and also extends the problem of vehicle routing with time windows. This new model is motivated by a resource allocation problem which appears in the service sector. We present two class of heuristic algorithms for the so...
متن کاملApproximation Algorithms for Parallel Machine Scheduling with Speed-up Resources
We consider the problem of scheduling with renewable speed-up resources. Given m identical machines, n jobs and c different discrete resources, the task is to schedule each job non-preemptively onto one of the machines so as to minimize the makespan. In our problem, a job has its original processing time, which could be reduced by utilizing one of the resources. As resources are different, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1996
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00058-5